Iterative Computation of Marginally Stable Trajectories
نویسنده
چکیده
Stability limits place restrictions on the economic operation of power systems. Calculation of these limits is therefore very important, but has traditionally been quite difficult. This paper proposes an iterative algorithm for determining parameter values that result in marginal stability of a system. (A system is marginally stable for a particular disturbance if the postdisturbance trajectory lies on the stability boundary.) The algorithm is based on GaussNewton solution of a nonlinear least-squares problem. Gradient information is provided by trajectory sensitivities.
منابع مشابه
Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملControl Theory and Economic Policy Optimization: The Origin, Achievements and the Fading Optimism from a Historical Standpoint
Economists were interested in economic stabilization policies as early as the 1930’s but the formal applications of stability theory from the classical control theory to economic analysis appeared in the early 1950’s when a number of control engineers actively collaborated with economists on economic stability and feedback mechanisms. The theory of optimal control resulting from the contributio...
متن کاملStatically Stable Legged
This paper deals with the problem of planning and controlling the trajectories of the legs of a mobile robot moving through statically stable conngurations. Legs are supposed to possess signiicant weight compared to the chassis, and a degree of redundancy that can be used to maximize the robustness of equilibrium. We use optimal control techniques for planning joint trajectories that comply wit...
متن کاملSurprising Computations
In the course of simulation of differential equations, especially of marginally stable differential problems using marginally stable numerical methods, one occasionally comes across a correct computation that yields surprising, or unexpected results. We examine several instances of such computations. These include (i) solving Hamiltonian ODE systems using almost conservative explicit Runge-Kutt...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003